Concentration of measure inequalities for Markov chains and $\Phi$-mixing processes
نویسندگان
چکیده
منابع مشابه
Concentration of Measure and Mixing for Markov Chains
We consider Markovian models on graphs with local dynamics. We show that, under suitable conditions, such Markov chains exhibit both rapid convergence to equilibrium and strong concentration of measure in the stationary distribution. We illustrate our results with applications to some known chains from computer science and statistical mechanics.
متن کاملComparison Inequalities and Fastest-mixing Markov Chains
We introduce a new partial order on the class of stochastically monotone Markov kernels having a given stationary distribution π on a given finite partially ordered state space X . When K L in this partial order we say that K and L satisfy a comparison inequality. We establish that if K1, . . . ,Kt and L1, . . . , Lt are reversible and Ks Ls for s = 1, . . . , t, then K1 · · ·Kt L1 · · ·Lt. In ...
متن کاملConcentration inequalities for Markov processes via coupling
We obtain moment and Gaussian bounds for general Lipschitz functions evaluated along the sample path of a Markov chain. We treat Markov chains on general (possibly unbounded) state spaces via a coupling method. If the first moment of the coupling time exists, then we obtain a variance inequality. If a moment of order 1+ ǫ of the coupling time exists, then depending on the behavior of the statio...
متن کاملMeasure Concentration of Hidden Markov Processes
We prove what appears to be the first concentration of measure result for hidden Markov processes. Our bound is stated in terms of the contraction coefficients of the underlying Markov process, and strictly generalizes the Markov process concentration results of Marton (1996) and Samson (2000). Somewhat surprisingly, the hidden Markov process is at least as “concentrated” as its underlying Mark...
متن کاملMeasure Concentration of Markov Tree Processes
We prove an apparently novel concentration of measure result for Markov tree processes. The bound we derive reduces to the known bounds for Markov processes when the tree is a chain, thus strictly generalizing the known Markov process concentration results. We employ several techniques of potential independent interest, especially for obtaining similar results for more general directed acyclic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2000
ISSN: 0091-1798
DOI: 10.1214/aop/1019160125